Finding well approximating lattices for a finite set of points

Finding fixed points in finite lattices

Recently there has been much interest in the abstract interpretation of declarative languages. Abstract interpretation is a semantics-based approach to program analysis that uses compile time evaluation of programs using simplified value domains. This gives information about the run-time properties of programs and provides the basis for significant performance improvements. A particular example...

New iteration process for approximating fixed points in Banach spaces

‎The object of this paper is to present a new iteration process‎. ‎We will show that our process is faster than the known recent iterative schemes‎. ‎We discuss stability results of our iteration and prove some results in the context of uniformly convex Banach space for Suzuki generalized nonexpansive mappings‎. ‎We also present a numerical example for proving the rate of convergence of our res...

Approximating fixed points of generalized nonexpansive mappings

Iterative methods for finding nearest common fixed points of a countable family of quasi-Lipschitzian mappings

We prove a strong convergence result for a sequence generated by Halpern's type iteration for approximating a common fixed point of a countable family of quasi-Lipschitzian mappings in a real Hilbert space. Consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...

Some lattices of closure systems on a finite set

In this paper we study two lattices of significant particular closure systems on a finite set, namely the union stable closure systems and the convex geometries. Using the notion of (admissible) quasi-closed set and of (deletable) closed set we determine the covering relation ≺ of these lattices and the changes induced, for instance, on the irreducible elements when one goes from C to C ′ where...